The First Eigenvalue of Random Graphs
نویسندگان
چکیده
منابع مشابه
The Largest Eigenvalue Of Sparse Random Graphs
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely: λ1(G) = (1 + o(1))max{ √ ∆, np}, where ∆ is a maximal degree of G, and the o(1) term tends to zero as max{ √ ∆, np} tends to infinity.
متن کاملOn the First Eigenvalue of Bipartite Graphs
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which is an analog of the Brualdi-Hoffman conjecture for general graphs, and prove the conjecture in some special cases.
متن کاملBulk Eigenvalue Correlation Statistics of Random Biregular Bipartite Graphs
In this paper, we consider the randommatrix ensemble given by (db, dw)-regular graphs onM black vertices andN white vertices, where db ∈ [N γ , N2/3−γ ] for any γ > 0. We simultaneously prove that the bulk eigenvalue correlation statistics for both normalized adjacency matrices and their corresponding covariance matrices are stable for short times. Combined with an ergodicity analysis of the Dy...
متن کاملThe Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric random intersection graphs. We examine symmetric random intersection graphs when the probability that a vertex selects a label is close to the connectivity threshold τc. In particular, we examine the size of the second eigenvalue o...
متن کاملOn the second eigenvalue and random walks n random d-regular graphs
The main goal of this paper is to estimate the magnitude of the second largest eigenvalue in absolute value, 2 , of (the adjacency matrix of) a random d-regular graph, G. In order to do so, we study the probability that a random walk on a random graph returns to its originating vertex at the k-th step, for various values of k. Our main theorem about eigenvalues is that E fj 2 (G)j m g 2 p 2d ? ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2005
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548305007030